A Method for Comparing Chess Openings

Solved Openings in Losing Chess

Losing Chess is a chess variant where each player tries to lose all one’s pieces. As the naming of “Giveaway” variants has multiple schools of terminology, we state for definiteness that captures are compulsory (a player with multiple captures chooses which to make), a King can be captured like any other piece, Pawns can promote to Kings, and castling is not legal. There are competing rulesets ...

Zipf's law in the popularity distribution of chess openings.

We perform a quantitative analysis of extensive chess databases and show that the frequencies of opening moves are distributed according to a power law with an exponent that increases linearly with the game depth, whereas the pooled distribution of all opening weights follows Zipf's law with universal exponent. We propose a simple stochastic process that is able to capture the observed playing ...

Comparing Extreme Members is a Low-Power Method of Comparing Groups: An Example Using Sex Differences in Chess Performance

Comparing Move Choices of Chess Search Engines

Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and t...

Analysis of Sequence Moves in Successful Chess Openings Using Data Mining with Association Rules

Chess is one of the indoor games, which improves the level of human confidence, concentration, planning skills and knowledge. The main objective of this paper is to help the chess players to improve their chess openings using data mining techniques. Budding Chess Players usually do practices by analyzing various existing openings. When they analyze and correlate thousands of openings it becomes...